3 Oblivious Routing Schemes
نویسنده
چکیده
where P̂ is a linear projection onto the space of circulations, i.e., of all the flows f with Bf = 0, and ĥ is some fixed unit s-t flow. As we showed last time, once we construct a projection P (·) then we obtain an (1 − ε)-approximate maximum flow algorithm whose performance is described in the following theorem. Theorem 1 If P (·) is an α-approximate affine `∞-projection P (·) onto the space Fst of unit s-t-flows, then one can compute an (1− )-approximate maximum flow in time
منابع مشابه
Chaotic Routing: An Overview
Of the many router designs, most can be classified as either oblivious or adaptive, depending on whether the path selection is statically determined based on the network topology, or whether dynamic information about congestion, priorities, or faults is considered. Adaptive algorithms can be broken down into two broad categories as well: minimal or non-minimal. Minimal adaptive algorithms allow...
متن کاملOptimal Oblivious Routing in Hole-Free Networks
We study oblivious routing algorithms in which the packet paths are constructed independently of each other. Oblivious algorithms are inherently distributed and they can be designed to efficiently balance the network utilization. We give an oblivious routing algorithm for the class of hole-free networks, in which the nodes are topologically embedded in simple areas of the plane. Such networks a...
متن کاملGuaranteed in-order packet delivery using Exclusive Dynamic Virtual Channel Allocation
In-order packet delivery, a critical abstraction for many higher-level protocols, can severely limit the performance potential in low-latency networks (common, for example, in network-on-chip designs with many cores). While basic variants of dimension-order routing guarantee in-order delivery, improving performance by adding multiple dynamically allocated virtual channels or using other routing...
متن کاملIntegrated Routing Protocol for Opportunistic Networks
In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot...
متن کاملA Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends only on the source and destination node of the packet. Furthermore packets use a shortest path with a minimal number of bends. We present an Ω(kn(d+1)/2) step lower bound for oblivious dimensional k-k routing algorithms...
متن کامل